Search results for " game theory"
showing 10 items of 120 documents
Olfactory cues and the value of information: voles interpret cues based on recent predator encounters
2018
Abstract Prey strategically respond to the risk of predation by varying their behavior while balancing the tradeoffs of food and safety. We present here an experiment that tests the way the same indirect cues of predation risk are interpreted by bank voles, Myodes glareolus, as the game changes through exposure to a caged weasel. Using optimal patch use, we asked wild-caught voles to rank the risk they perceived. We measured their response to olfactory cues in the form of weasel bedding, a sham control in the form of rabbit bedding, and an odor-free control. We repeated the interviews in a chronological order to test the change in response, i.e., the changes in the value of the information.…
Harsanyi Power Solutions for Cooperative Games on Voting Structures
2019
International audience; This paper deals with Harsanyi power solutions for cooperative games in which partial cooperation is based on specific union stable systems given by the winning coalitions derived from a voting game. This framework allows for analyzing new and real situations in which there exists a feedback between the economic influence of each coalition of agents and its political power. We provide an axiomatic characterization of the Harsanyi power solutions on the subclass of union stable systems arisen from the winning coalitions from a voting game when the influence is determined by a power index. In particular, we establish comparable axiomatizations, in this context, when co…
Strategic Thinking under social influence: Scalability, stability and robustness of allocations
2016
This paper studies the strategic behavior of a large number of game designers and studies the scalability, stability and robustness of their allocations in a large number of homogeneous coalitional games with transferable utilities (TU). For each TU game, the characteristic function is a continuous-time stochastic process. In each game, a game designer allocates revenues based on the extra reward that a coalition has received up to the current time and the extra reward that the same coalition has received in the other games. The approach is based on the theory of mean-field games with heterogeneous groups in a multi-population regime.
Robust Mean Field Games with Application to Production of an Exhaustible Resource
2012
International audience; In this paper, we study mean field games under uncertainty. We consider a population of players with individual states driven by a standard Brownian motion and a disturbance term. The contribution is three-fold: First, we establish a mean field system for such robust games. Second, we apply the methodology to an exhaustible resource production. Third, we show that the dimension of the mean field system can be significantly reduced by considering a functional of the first moment of the mean field process.
Non-convex power allocation games in MIMO cognitive radio networks
2013
Consideramos un escenario de reparto del espectro, basado en la detección, en una red de radio cognitiva MIMO donde el objetivo general es maximizar el rendimiento total de cada usuario de radio cognitiva optimizando conjuntamente la operación de detección y la asignación de potencia en todos los canales, bajo una restricción de interferencia para los usuarios primarios. Los problemas de optimización resultantes conducen a un juego no convexo, que presenta un nuevo desafío a la hora de analizar los equilibrios de este juego. Con el fin de hacer frente a la no convexidad del juego, utilizamos un nuevo concepto relajado de equilibrio, el equilibrio cuasi-Nash (QNE). Se demuestran las condicio…
Utility-based resource allocations in multi-hop wireless networks
2011
It is well known that CSMA (Carrier Sense Multiple Access) protocols exhibit very poor performance in case of multi-hop transmissions, because of inter-link interference due to imperfect carrier sensing. Since ad-hoc networks based on multihop packet deliveries are becoming more and more common in different application and networking scenarios, different medium access control extensions are currently considered for improving the channel utilization efficiency. In this paper, we propose a simple approach based on preallocating temporal slots in which different sets of nodes are allowed to contend for the channel access, which can significantly improve CSMA performance with limited signaling …
An alliance timing game under real options in biopharmaceutical industry
2014
Robust Allocation Rules in Dynamical Cooperative TU Games
2011
Robust dynamic coalitional TU games are repeated TU games where the values of the coalitions are unknown but bounded variables. We set up the game supposing that the Game Designer uses a vague measure of the extra reward that each coalition has received up to the current time to re-adjust the allocations among the players. As main result, we provide a constructive method for designing allocation rules that converge to the core of the average game. Both the set up and the solution approach also provide an insight on commonalities between coalitional games and stability theory.
The meaning of biological signals.
2020
We introduce the virtual special issue on content in signalling systems. The issue explores the uses and limits of ideas from evolutionary game theory and information theory for explaining the content of biological signals. We explain the basic idea of the Lewis-Skyrms sender-receiver framework, and we highlight three key themes of the issue: (i) the challenge of accounting for deception, misinformation and false content, (ii) the relevance of partial or total common interest to the evolution of meaningful signals, and (iii) how the sender-receiver framework relates to teleosemantics.
Nonlocal Quantum XOR Games for Large Number of Players
2010
Nonlocal games are used to display differences between classical and quantum world In this paper, we study nonlocal games with a large number of players We give simple methods for calculating the classical and the quantum values for symmetric XOR games with one-bit input per player, a subclass of nonlocal games We illustrate those methods on the example of the N-player game (due to Ardehali [Ard92]) that provides the maximum quantum-over-classical advantage.